Lagrangian Relaxation via Ballstep Subgradient Methods
نویسندگان
چکیده
منابع مشابه
Approximate Subgradient Methods for Lagrangian Relaxations on Networks
Nonlinear network flow problems with linear/nonlinear side constraints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on the set defined by the network constraints. We study alternative stepsizes in the approximate subgradient methods to solve the dual problem. S...
متن کاملApproximate Subgradient Methods over Lagrangian Relaxations on Networks
where A is a node-arc incidencem×n-matrix, b is the production/demand m-vector, x are the flows on the arcs of the network represented by A, and x are the capacity bounds imposed on the flows of each arc. • The side constraints c(x) ≤ 0 are defined by c : <n → <r, such that c = [c1, · · · , cr], where ci(x) is either linear, or nonlinear and twice continuously differentiable on the feasible set...
متن کاملTraining Generative Adversarial Networks via Primal-Dual Subgradient Methods: A Lagrangian Perspective on GAN
We relate the minimax game of generative adversarial networks (GANs) to finding the saddle points of the Lagrangian function for a convex optimization problem, where the discriminator outputs and the distribution of generator outputs play the roles of primal variables and dual variables, respectively. This formulation shows the connection between the standard GAN training process and the primal...
متن کاملSubgradient Methods
3 Convergence proof 4 3.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Some basic inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 A bound on the suboptimality bound . . . . . . . . . . . . . . . . . . . . . . 7 3.4 A stopping criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.5 Numerical examp...
متن کاملDynamic Routing and Queue Management via Bundle Subgradient Methods
In this paper we propose a purely distributed dynamic network routing algorithm that simultaneously regulates queue sizes across the network. The algorithm is distributed since each node decides on its outgoing link flows based only on its own and its immediate neighbors’ information. Therefore, this routing method will be adaptive and robust to changes in the network topology, such as the node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2007
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1070.0261